#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}

template<typename T> 
inline void read(T &x){
	x=0;T f=1;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}



VI get_next(string &s){
	VI ne(s.size()+1);
	ne[0]=-1;
	int i=0,j=-1;
	while(i<s.size()){
		if(j==-1||s[i]==s[j]){
			++i;++j;
			ne[i]=j;
		}else j=ne[j];
	}
	return ne;
}

int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
	string s1,s2;
	cin>>s1>>s2;
	VI ne=get_next(s2);
	int i=0,j=0;
	while(i<s1.size()){
		if(j==-1||s1[i]==s2[j]){
			++i;++j;
			if(j==s2.size()){
				printf("%d\n",i-(int)s2.size()+1);
				j=ne[j];
			}
		}else j=ne[j];
	}
	for(int i=1;i<ne.size();i++)printf("%d ",ne[i]);
	printf("\n");
}